Free inductive K-semialgebras
نویسندگان
چکیده
We consider rational power series over an alphabet Σ with coefficients in a ordered commutative semiring K and characterize them as the free ordered K-semialgebras in various classes of ordered K-semialgebras equipped with a star operation satisfying the least prefixed point rule and/or its dual. The results are generalizations of Kozen’s axiomatization of regular languages.
منابع مشابه
Multi-Linear Iterative K-Σ-Semialgebras
We consider K-semialgebras for a commutative semiring K that are at the same time Σ-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over such an algebra, then we call it an iterative multi-linear K-Σ-semialgebra. Examples of such algebras include the algebras of Σ-tree series over an alphabet A with coe...
متن کاملFree iterative and iteration K-semialgebras
We consider algebras of rational power series over a finite alphabet Σ with coefficients in a commutative semiring K and characterize them as the free algebras in various classes of algebraic structures.
متن کاملMulti-linear iterative K-Sigma-semialgebras
We consider K-semialgebras for a commutative semiring K that are at the same time Σ-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over such an algebra, then we call it an iterative multi-linear K-Σ-semialgebra. Examples of such algebras include the algebras of Σ-tree series over an alphabet A with coe...
متن کاملSoftware Verification Using k-Induction Extended version including appendix with proofs
We present combined-case k-induction, a novel technique for verifying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by separately proving a base case and inductive step. We present a new k-induction rule that takes an u...
متن کاملInductive Methods and Zero-sum Free Sequences
A fairly long-standing conjecture is that the Davenport constant of a group G = Zn1 ⊕ · · · ⊕ Znk with n1| . . . |nk is 1 + ∑k i=1(ni − 1). This conjecture is false in general, but it remains to know for which groups it is true. By using inductive methods we prove that for two fixed integers k and ! it is possible to decide whether the conjecture is satisfied for all groups of the form Zk ⊕ Zn ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Algebr. Program.
دوره 82 شماره
صفحات -
تاریخ انتشار 2013